Majoration explicite sur le nombre de coefficients suffisants pour déterminer une fonction L
نویسندگان
چکیده
منابع مشابه
Correspondances d’agrégation de jugements basées sur le nombre de votes
Judgment aggregation consists in making collective decisions on a set of issues from the judgments expressed by individual agents on these issues. The resulting decisions take the form of social judgements sets in which issues are accepted or rejected. Many important results in judgment aggregation take the form of impossibility theorems, identifying sets of rationality conditions cannot be joi...
متن کاملConception Et Simulation D'un Modele Base Sur Le Ccv Pour L'amelioration De La Fonction Maintenance
RESUME : Le présent travail s’inscrit dans un processus d’amélioration continue de la fonction maintenance des entreprises industrielles. L’objectif recherché dans cette communication est de définir une nouvelle approche de mesure de performance de la fonction maintenance au niveau stratégique de l’entreprise. Cette approche constituera pour le manager un outil qui lui permettra d’identifier le...
متن کاملUne approche adaptative pour la recherche d'information sur le Web
The advent of the Web in the early 90s has deeply upset our society. This new media has rapidly become the greatest database in the world. Moreover, the ever increasing popularity of the Web engendered a huge dynamics with respect to Web data. Actually, by virtue of knowledge evolution, data is permanently added, deleted or updated from the Web which raises important issues regarding Web inform...
متن کاملNAC, une architecture pour l'adaptation multimédia sur le web
The web is evolving towards richer contents and diverse media that are accessed with different devices through multiple kinds of network. This heterogeneous, mobile and changing environment requires that multimedia information delivered by servers be adapted to the actual conditions of use. For that purpose, a number of methods, languages, formats and protocols are developed, especially by W3C....
متن کاملUne contrainte globale pour le problème de l'isomorphisme de graphes
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms which can take advantage of the global sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2017
ISSN: 1246-7405,2118-8572
DOI: 10.5802/jtnb.969